conquer vt. 1.征服;攻克;打敗(敵人)。 2.克服(困難等),改正(惡習(xí)等);抑制(情欲等)。 3.〔古、詩(shī)〕贏得(名譽(yù),某人的感情等)。 conquer the enemy征服敵人。 conquer bad habits 克服不良習(xí)慣。 conquer passions 壓制情欲。 the conquered 被征服者,敗者。 vi. 得勝。 stoop to conquer 忍辱取勝;降低身分以達(dá)到目的。 To conquer or to die. 非勝即死,不成功便成仁。
divide vt. 1.分,區(qū)分,劃分 (into)。 2.分配,分派,分給;分享,分擔(dān),分?jǐn)?(with; between; among)。 3.分開(kāi),隔開(kāi),隔離 (from)。 4.分裂,使對(duì)立;使(意見(jiàn))分歧,離間(朋友);【化學(xué)】分離。 5.【數(shù)學(xué)】除;除盡;【機(jī)械工程】在…上刻[分]度。 divide words between syllables 給單詞分音節(jié)。 Administratively, the country is divided into counties. 這個(gè)國(guó)家在行政區(qū)劃分上分為許多郡。 The river divides the city into two parts. 那條河把市區(qū)分成兩部分。 Opinions are divided on that point. 意見(jiàn)就在那一點(diǎn)上對(duì)立起來(lái)了。 divide ten dollars among five persons 十塊美元五個(gè)人分。 divide profits with the stock-holders 和股東共分利潤(rùn)。 D- 6 by 3 and you get 2. 給3除6得2。 9 divides 36. 9 能除盡36。 divide a sextant 給六分儀分度。 be divided against itself 發(fā)生內(nèi)訌 (If a house be divided against itself, that house cannot stand. 家不和,必自敗)。 vi. 1.分,分開(kāi)。 2.分裂,(意見(jiàn)等)分歧。 3.【數(shù)學(xué)】除,被除盡。 4.(議會(huì)等)表決。 divide in one's mind 猶豫不決。 We all divide equally. 我們平等分配,各取一份。 The road divides six miles from here. 這條路在六英里之外有分岔。 He could add and subtract, but hadn't learned to divide. 他會(huì)做加減法,但還沒(méi)有學(xué)會(huì)除法。 Eight divides by four. 8能被4除盡。 Five will not divide into nine. 5除不盡9。 D-! D-! (議會(huì)等中提出)表決!表決! n. 1.分,分配。 2.〔口語(yǔ)〕分裂。 3.分界;〔美國(guó)〕分水嶺。 divide and rule 分而治之。 the Great D- 1. 〔美國(guó)〕落磯山脈分水嶺;主要分水嶺。 2. 大限;死;生死關(guān)頭 (cross the Great D- 死)。
Parallel divide and conquer algorithm with multisection for real symmetric band generalized eigenvalue problem 計(jì)算對(duì)稱帶狀矩陣廣義特征值問(wèn)題的并行分治多分法
Discussing the polygon union algorithms on the cgal and planar map platform . they are arrangement algorithm , incremental union algorithm and divide and conquer algorithm 基于cgal的平面圖,討論了多邊形合并算法:排列合并算法、增量合并算法以及divide與conquer算法。
百科解釋
In computer science, divide and conquer (D&C) is an important algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same (or related) type, until these become simple enough to be solved directly.